computer notes - Data Structures - 13

Class No.13 Data Structures http://ecomputernotes.com

Trace of insert 17, 9, 14, 5 14 15 4 9 7 18 3 5 16 20 17 p p->setRight( node ); node http://ecomputernotes.com

Cost of Search ,[object Object],[object Object],[object Object],[object Object],http://ecomputernotes.com

Cost of Search ,[object Object],[object Object],[object Object],http://ecomputernotes.com

Binary Search Tree ,[object Object],[object Object],[object Object],http://ecomputernotes.com

Traversing a Binary Tree ,[object Object],[object Object],[object Object],http://ecomputernotes.com

Traversing a Binary Tree ,[object Object],14 15 4 (4, 14, 15), (4,15,14) (14,4,15), (14,15,4) (15,4,14), (15,14,4) http://ecomputernotes.com

Traversing a Binary Tree ,[object Object],node (L,N,R), (L,R,N) (N,L,R), (N,R,L) (R,L,N), (R,N,L) left subtree right subtree L N R http://ecomputernotes.com

Traversing a Binary Tree ,[object Object],node Preorder: (N,L,R) Inorder: (L,N,R) Postorder: (L,R,N) left subtree right subtree L N R http://ecomputernotes.com

Traversing a Binary Tree void preorder(TreeNode<int>* treeNode) { if( treeNode != NULL ) { cout << *(treeNode->getInfo())<<" "; preorder(treeNode->getLeft()); preorder(treeNode->getRight()); } } http://ecomputernotes.com

Traversing a Binary Tree void inorder(TreeNode<int>* treeNode) { if( treeNode != NULL ) { inorder(treeNode->getLeft()); cout << *(treeNode->getInfo())<<" "; inorder(treeNode->getRight()); } } http://ecomputernotes.com

Traversing a Binary Tree void postorder(TreeNode<int>* treeNode) { if( treeNode != NULL ) { postorder(treeNode->getLeft()); postorder(treeNode->getRight()); cout << *(treeNode->getInfo())<<" "; } } http://ecomputernotes.com

Traversing a Binary Tree cout << "inorder: "; preorder( root); cout << "inorder: "; inorder( root ); cout << "postorder: "; postorder( root ); http://ecomputernotes.com

Traversing a Binary Tree Preorder: 14 4 3 9 7 5 15 18 16 17 20 14 15 4 9 7 18 3 5 16 20 17 http://ecomputernotes.com

Traversing a Binary Tree Inorder: 3 4 5 7 9 14 15 16 17 18 20 14 15 4 9 7 18 3 5 16 20 17 http://ecomputernotes.com

Traversing a Binary Tree Postorder: 3 5 7 9 4 17 16 20 18 15 14 14 15 4 9 7 18 3 5 16 20 17 http://ecomputernotes.com

Recursive Call ,[object Object],[object Object],[object Object],[object Object],http://ecomputernotes.com

Stack Layout during a call ,[object Object],Parameters(F) Local variables(F) Return address(F) Parameters(F) Parameters(F) Local variables(F) Return address(F) Parameters(F) Local variables(F) Return address(F) Parameters(F) Local variables(F) Return address(F) During execution of F After call At point of call sp sp sp http://ecomputernotes.com

computer notes - Data Structures - 13

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (20)

Similar to computer notes - Data Structures - 13

Similar to computer notes - Data Structures - 13 (20)

More from ecomputernotes

More from ecomputernotes (19)

Recently uploaded

Recently uploaded (20)

computer notes - Data Structures - 13

Editor's Notes